On the Semantics of Message Passing Processes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Semantics of Message Passing Processes

Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable universe of shapes, systems can model concurrent and asynchronous computation. By labelling in a category,...

متن کامل

A graph model of message passing processes

In the paper we consider a graph model of message passing processes and present a method verification of message passing processes. The method is illustrated by an example of a verification of sliding window protocol.

متن کامل

The Communication Semantics of the Message Passing Interface

The Message Passing Interface (MPI) standard is a natural language document that describes a software library for interprocess communication. Automatic reasoning about the reactive nature of programs communicating via MPI libraries is not possible without also analizing the library being used. Many distributed programs that use MPI are relatively brief compared to the libraries that implement M...

متن کامل

Type-checked message-passing between functional processes

Karlsson introduced the notion of communicating functional processes [Karlsson81]. It relied on a non-deterministic function, used within the functional program, to implement message-passing between processes. Stoye described a sorting office for inter-process messages which removed the need for non-determinism in the functional language [Stoye86]. Turner added a limited form of static type-che...

متن کامل

A Presheaf Semantics of Value-Passing Processes

This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operational semantics. Both “early” and “late” semantics are considered, though the more interesting “late”...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 1999

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)80306-8